Primal–Dual Proximal Splitting and Generalized Conjugation in Non-smooth Non-convex Optimization
نویسندگان
چکیده
منابع مشابه
Convergence Analysis of the Approximate Proximal Splitting Method for Non-Smooth Convex Optimization
Consider a class of convex minimization problems for which the objective function is the sum of a smooth convex function and a non-smooth convex regularity term. This class of problems includes several popular applications such as compressive sensing and sparse group LASSO. In this thesis, we introduce a general class of approximate proximal splitting (APS) methods for solving such minimization...
متن کاملInexact Proximal Gradient Methods for Non-convex and Non-smooth Optimization
Non-convex and non-smooth optimization plays an important role in machine learning. Proximal gradient method is one of the most important methods for solving the nonconvex and non-smooth problems, where a proximal operator need to be solved exactly for each step. However, in a lot of problems the proximal operator does not have an analytic solution, or is expensive to obtain an exact solution. ...
متن کاملRelaxed Majorization-Minimization for Non-Smooth and Non-Convex Optimization
We propose a new majorization-minimization (MM) method for non-smooth and non-convex programs, which is general enough to include the existing MM methods. Besides the local majorization condition, we only require that the difference between the directional derivatives of the objective function and its surrogate function vanishes when the number of iterations approaches infinity, which is a very...
متن کاملIpiano: Inertial Proximal Algorithm for Non-convex Optimization
This paper studies the minimization of non-convex and non-smooth composite functions. In particular, we discuss the algorithm proposed by Ochs et al. in [14], called iPiano. Following [14], we present a global convergence result for functions satisfying the Kurdyka-Lojasiewicz property [12, 11] which is based on the work by Attouch et al. [4]. Furthermore, we discuss the implementation of iPian...
متن کاملNew Proximal Bundle Method for Non- smooth DC Optimization
In this paper, we develop a version of the bundle method to locally solve unconstrained difference of convex (DC) programming problems. It is assumed that a DC representation of the objective function is available. Our main idea is to use subgradients of both the first and second components in the DC representation. This subgradient information is gathered from some neighborhood of the current ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics & Optimization
سال: 2020
ISSN: 0095-4616,1432-0606
DOI: 10.1007/s00245-020-09676-1